Sufficient matrices and the linear complementarity problem
نویسندگان
چکیده
منابع مشابه
The Linear Complementarity Problem, Sufficient Matrices, and the Criss-Cross Method
Specially structured linear complementarity problems (LCPs) and their solution by the miss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, ro...
متن کاملThe linear complementarity problem , sufficient matrices and the criss - cross method Report 90 - 49
Specially structured Linear Complementarity Problems (LCP's) and their solution by the criss{ cross method are examined in this paper. The criss{cross method is known to be nite for LCP's with positive semide nite bisymmetric matrices and with P{matrices. It is also a simple nite algorithm for oriented matroid programming problems. Recently Cottle, Pang and Venkateswaran identi ed the class of ...
متن کاملPc { Matrices and the Linear Complementarity
We introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q 2 I R n. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc \Q0. We further investigate the relationship of the ...
متن کاملThe extended linear complementarity problem
In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We show that the ELCP can be viewed as a kind of unifying framework for the LCP and its various generalizations. We study the general solution set of an ELCP and we develop an algorithm to find all its solutions. We also show that the general ELCP is a...
متن کاملThe Extended Linear Complementarity Problem
We consider an extension of the horizontal linear complementarityproblem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90463-1